- primal variables
- переменные прямой задачи
English-Russian dictionary of computer science. 2015.
English-Russian dictionary of computer science. 2015.
Primal therapy — is a trauma based psychotherapy created by Arthur Janov, Ph.D. Arthur Janov claims that neurosis is caused by repressed pain which is the result of childhood trauma. Janov claims that repressed pain can be brought to consciousness and resolved,… … Wikipedia
Primal constraint graph — In constraint satisfaction, the primal constraint graph or simply primal graph (also the Gaifman graph) of a constraint satisfaction problem is the graph whose nodes are the variables of the problem and an edge joins a pair of variables if the… … Wikipedia
Optimus primal (maximal) — Optimus Primal (puis Optimal Optimus dans la saison 3) est un personnage principal des séries Animutants et Beast Machines: Transformers. Il est le chef des maximals et, en tout point, l opposé de son équivalent prédator, Mégatron II. Optimus… … Wikipédia en Français
Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia
LPBoost — Linear Programming Boosting (LPBoost) is a supervised classifier from the Boosting family of classifiers. LPBoost maximizes a margin between training samples of different classes and hence also belongs to the class of margin maximizing supervised … Wikipedia
FETI-DP — The FETI DP method is a domain decomposition method by Charbel Farhat and others, C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen, FETI DP: a dual primal unified FETI method. I. A faster alternative to the two level FETI method ,… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Optimisation linéaire — En optimisation, qui est une branche des mathématiques, un problème d optimisation linéaire est un problème d optimisation dans lequel on minimise une fonction linéaire sur un polyèdre convexe. La fonction coût et les contraintes peuvent donc… … Wikipédia en Français
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia